a = input()
b = input()
k = 0
a1, b1 = sorted(a), sorted(b)
if a1 == b1:
for i in range(len(a)):
if a[i] != b[i]:
k += 1
if k == 2:
print("YES")
else:
print("NO")
else:
print("NO")#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main()
{
speed;
string s1,s2;
cin >> s1 >> s2;
unordered_set<char>st1, st2;
for(int i=0;i<s1.size();i++){
st1.insert(s1[i]);
}
for(int i=0;i<s2.size();i++){
st2.insert(s2[i]);
}
if(s1.size() != s2.size() || st2 != st1) {
cout << "NO";
return 0;
}
int cnt = 0;
for(int i=0;i<s1.size();i++) {
if(s1[i] != s2[i]) cnt++;
}
if(cnt == 0 || cnt == 2) cout << "YES";
else cout << "NO";
}870A - Search for Pretty Integers | 1174A - Ehab Fails to Be Thanos |
1169A - Circle Metro | 780C - Andryusha and Colored Balloons |
1153A - Serval and Bus | 1487C - Minimum Ties |
1136A - Nastya Is Reading a Book | 1353B - Two Arrays And Swaps |
1490E - Accidental Victory | 1335A - Candies and Two Sisters |
96B - Lucky Numbers (easy) | 1151B - Dima and a Bad XOR |
1435B - A New Technique | 1633A - Div 7 |
268A - Games | 1062B - Math |
1294C - Product of Three Numbers | 749A - Bachgold Problem |
1486B - Eastern Exhibition | 1363A - Odd Selection |
131B - Opposites Attract | 490C - Hacking Cypher |
158B - Taxi | 41C - Email address |
1373D - Maximum Sum on Even Positions | 1574C - Slay the Dragon |
621A - Wet Shark and Odd and Even | 1395A - Boboniu Likes to Color Balls |
1637C - Andrew and Stones | 1334B - Middle Class |